Balanced Boolean Functions with (more than) Maximum Algebraic Immunity
نویسندگان
چکیده
In this correspondence, construction of balanced Boolean functions with maximum possible algebraic (annihilator) immunity (AI) is studied with an additional property which is necessary to resist fast algebraic attack. The additional property considered here is, given an n-variable (n even) balanced function f with maximum possible AI n 2 , and given two n-variable Boolean functions g, h such that fg = h, if deg(h) = n 2 , then deg(g) must be greater than or equal to n 2 . Our results can also be used to present theoretical construction of resilient Boolean functions having maximum possible AI.
منابع مشابه
Evolving balanced Boolean functions with optimal resistance to algebraic and fast algebraic attacks, maximal algebraic degree, and very high nonlinearity
Using simulated annealing, we derive several equivalence classes of balanced Boolean functions with optimum algebraic immunity, fast algebraic resistance, and maximum possible algebraic degree. For numbers n of input bits less than 16, these functions also possess superior nonlinearity to all Boolean functions so far obtained with said properties.
متن کاملLower Bounds on Algebraic Immunity of Boolean Functions
In the recently developed algebraic attacks applying to block and stream ciphers([1-5]), the concept of algebraic immunity (AI) is introduced in [6] and studied in [6-14]. High algebraic immunity is a necessary condition for resisting algebraic attacks. In this paper, we give some lower bounds on algebraic immunity of Boolean functions. The results are applied to give lower bounds on AI of symm...
متن کاملLower Bounds on the Algebraic Immunity of Boolean Functions
From the motivation of algebraic attacks to stream and block ciphers([1,2,7,13,14,15]), the concept of algebraic immunity (AI) of a Boolean function was introduced in [21] and studied in [3,5,10,11,17,18,19,20,21]. High algebraic immunity is a necessary condition for resisting algebraic attacks. In this paper, we give some lower bounds on the algebraic immunity of Boolean functions. The results...
متن کاملConstructing and Counting Even-Variable Symmetric Boolean Functions with Algebraic Immunity not Less Than $d$
In this paper, we explicitly construct a large class of symmetric Boolean functions on 2k variables with algebraic immunity not less than d, where integer k is given arbitrarily and d is a given suffix of k in binary representation. If let d = k, our constructed functions achieve the maximum algebraic immunity. Remarkably, 22 k⌋+2 symmetric Boolean functions on 2k variables with maximum algebra...
متن کاملBalanced Boolean Functions with (Almost) Optimal Algebraic Immunity and Very High Nonlinearity
In this paper, we present a class of 2k-variable balanced Boolean functions and a class of 2k-variable 1-resilient Boolean functions for an integer k ≥ 2, which both have the maximal algebraic degree and very high nonlinearity. Based on a newly proposed conjecture by Tu and Deng, it is shown that the proposed balanced Boolean functions have optimal algebraic immunity and the 1-resilient Boolean...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- IACR Cryptology ePrint Archive
دوره 2006 شماره
صفحات -
تاریخ انتشار 2006